Subsymbolic Computation Theory for the Human Intuitive Processor

نویسنده

  • Paul Smolensky
چکیده

The classic theory of computation initiated by Turing and his contemporaries provides a theory of effective procedures — algorithms that can be executed by the human mind, deploying cognitive processes constituting the conscious rule interpreter. The cognitive processes constituting the human intuitive processor potentially call for a different theory of computation. Assuming that important functions computed by the intuitive processor can be described abstractly as symbolic recursive functions and symbolic grammars, we ask which symbolic functions can be computed by the human intuitive processor, and how those functions are best specified — given that these functions must be computed using neural computation. Characterizing the automata of neural computation, we begin the construction of a class of recursive symbolic functions computable by these automata, and the construction of a class of neural networks that embody the grammars defining formal languages. 1 Effective Procedures vs. Intuitive Cognitive Processes What is the set of functions computable by human intuition? Intuitive cognitive processes contrast with conscious rule interpretation [9], the mental processes enabling a clerk to take a list of English instructions and carry out a complex mathematical calculation by consciously interpreting those instructions one after another. Less mundanely, the Entscheidungsproblem also concerns the capabilities of conscious rule interpretation: Turing’s 1936 paper [14] and other classic works provide a theory of the set of functions computable by human conscious rule interpretation, i.e., by effective procedures. Other notions of computation yielding different sets of computable functions derive from alternative conceptions of ‘machine’ in the sense of physical artifact (e.g., differential analyzer, optical or quantum computer). But it is a natural biological system, the brain, that motivates the conception of computation of interest here. Within one stream of cognitive science [10], models of the brain and models of mental processes converged around 30 years ago upon a class of computational systems for modeling intuition, a class known variously as ‘connectionist’, ‘parallel distributed processing’, or ‘abstract neural network’ computational architectures [7]. Since the dawn of modern cognitive science in the middle of the 20th century, many cognitive scientists have treated intuition as formally identical with conscious rule interpretation, but inaccessible to consciousness [10]. Within this

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

of the Nonconscious Acquisition A Symbolic Model

This article presents counter evidence against Smolensky’s theory thot human intuitive/nonconscious congnitive processes can only be accurately explained in terms of subsymbolic computations carried out in artificial neural networks. We present symbolic learning models of two well-studied, complicated cognitive tasks involving nonconscious acquisition of information: learning production rules a...

متن کامل

A Symbolic Model of the Nonconscious Acquisition of Information

The paper presents counter evidence against Smolensky's theory that human in-tuitive/nonconscious cognitive processes can only be accurately explained in terms of subsymbolic computations carried out in artiicial neural networks. We present symbolic learning models of two well studied, complicated cognitive tasks involving nonconscious acquisition of information: learning production rules and a...

متن کامل

The Interplay of Symbolic and Subsymbolic Processes in Anagram Problem Solving

Although connectionist models have provided insights into the nature of perception and motor control, connectionist accounts of higher cognition seldom go beyond an implementation of traditional symbol-processing theories. We describe a connectionist constraint satisfaction model of how people solve anagram problems. The model exploits statistics of English orthography, but also addresses the i...

متن کامل

Pursuit and Evasion on a Ring : An In nite Hierarchy for Parallel Real - Time Systems Stefan

We present a new complexity theoretic approach to real-time parallel computations. Based on the theory of timed !-languages, we deene complexity classes that capture the intuitive notion of resource requirements for real-time computations in a parallel environment. Then, we show that, for any positive integer n, there exists at least one timed !-language Ln which is accepted by a 2n-processor r...

متن کامل

Text and Discourse Understanding: The DISCERN System

The subsymbolic approach to natural language processing (NLP) captures a number of intriguing properties of human-like information processing such as learning from examples, context sensitivity, generalization, robustness of behavior, and intuitive reasoning. Within this new paradigm, the central issues are quite di erent from (even incompatible with) the traditional issues in symbolic NLP, and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012